Metric Predicate Transformers : Towards aNotion of Re nement for
نویسندگان
چکیده
A compositional weakest precondition semantics is given for a parallel language with recursion using a new metric resumption domain. By extending the classical duality of predicate vs. state transformers, the weakest precondition semantics for the parallel language is shown to be isomorphic to the standard metric state transformer semantics. Moreover , a notion of reenement for predicate transformers is proposed which corresponds to the familiar notion of simulation for state transformers.
منابع مشابه
Metric Predicate Transformers : Towards a Notion of Re nement for ConcurrencyMarcello
For two parallel languages with recursion a compositional weakest precondition semantics is given using two new metric resumption domains. The underlying domains are characterized by domain equations involving functors that deliveròbservable' and`safety' predicate transformers. Further a reenement relation is deened for this domains and illustrated by rules dealing with concurrent composition. ...
متن کاملProgramming Research Group Proof Rules for Probablistic Loops
Probabilistic predicate transformers provide a semantics for imperative programs containing both demonic and probabilistic nondeterminism. Like the (standard) predicate transformers popularised by Dijkstra, they model programs as functions from nal results to the initial conditions su cient to achieve them. This paper presents practical proof rules, using the probabilistic transformers, for rea...
متن کاملReenement and Continuous Behaviour
Re nement Calculus is a formal framework for the development of provably correct software It is also used in the development of Action Systems which is a predicate transformer based framework for constructing distributed and reactive software systems Recently Action Systems were extended with a new action called the di erential action It allows the modelling of con tinuous behaviour Along with ...
متن کاملMechanized Semantics of Simple Imperative Programming Constructs
In this paper a uniform formalization in PVS of various kinds of semantics of imper ative programming language constructs is presented Based on a comprehensive de velopment of xed point theory the denotational semantics of elementary constructs of imperative programming languages are de ned as state transformers These state transformers induce corresponding predicate transformers providing a me...
متن کاملA Parallel Operator for Real - Time Processes withPredicate
We present a high level speciication and reenement framework for concurrent real-time processes with strict message passing based on predicate transformer semantics. Four diierent parallel operators are deened and we investigate conditions under which they are monotone and associative. Re-nement rules for single process components are derived. We also give rules and strategies for the developme...
متن کامل